Hop “Condition”

نویسندگان

چکیده

برای دانلود باید عضویت طلایی داشته باشید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

On Hop Roman Domination in Trees

‎Let $G=(V,E)$ be a graph‎. ‎A subset $Ssubset V$ is a hop dominating set‎‎if every vertex outside $S$ is at distance two from a vertex of‎‎$S$‎. ‎A hop dominating set $S$ which induces a connected subgraph‎ ‎is called a connected hop dominating set of $G$‎. ‎The‎‎connected hop domination number of $G$‎, ‎$ gamma_{ch}(G)$,‎‎‎ ‎is the minimum cardinality of a connected hop‎‎dominating set of $G$...

متن کامل

Hop-by-hop quality of service routing

Based on SAMCRA, an improved and exact version of our QoS routing algorithm TAMCRA, we have investigated QoS routing in a hop-by-hop manner because it forms the basis of IP networking as e.g. in OSPF. In particular, we studied ‘hop-by-hop destination based only’ (HbHDBO) QoS routing that ignores the source and previous path history (as in current IP routing). We demonstrate that an exact QoS al...

متن کامل

Hop By Hop Multicast Routing Protocol ∗ Luı́s

IP Multicast is facing a slow take-off although it is a hotly debated topic since more than a decade. Many reasons are responsible for this status. Hence, the Internet is likely to be organized with both unicast and multicast enabled networks. Thus, it is of utmost importance to design protocols that allow the progressive deployment of the multicast service by supporting unicast clouds. This pa...

متن کامل

Hopscotch - reaching the target hop by hop

Concrete and abstract relation algebras have widespread applications in computer science. One of the most famous is graph theory. Classical relations, however, only reason about connectivity, not about the length of a path between nodes. Generalisations of relation algebra, such as the min-plus algebra, use numbers allowing the treatment of weighted graphs. In this way one can for example deter...

متن کامل

Hop-by-Hop TCP for Sensor Networks

Communication links in a sensor network are unstable such that running conventional TCP protocol over a high loss rate sensor networks will suffer from severe performance degradation. To handle a packet loss, conventional TCP retransmits the lost packet from its source. However, when error rate is high, it may have difficulty to deliver a packet to its destination. Considering that most applica...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: Nature

سال: 1883

ISSN: 0028-0836,1476-4687

DOI: 10.1038/028564d0